Ohba’s Conjecture is True for Graphs with Independence Number 3

نویسنده

  • Daniel W. Cranston
چکیده

Ohba’s conjecture states that if a graph G has chromatic number χ(G) = k and has at most 2k+1 vertices, then G has choice number Ch(G) equal to χ(G). We prove that Ohba’s conjecture is true for each graph that has independence number 3. We also prove that Ohba’s conjecture is true for each graph G that has an independent set S of size 4 such that G\S has independence number 3.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards on-line Ohba's conjecture

Ohba conjectured that every graph G with |V (G)|6 2χ(G)+1 has its choice number equal its chromatic number. The on-line choice number of a graph is a variation of the choice number defined through a two person game, and is always at least as large as its choice number. Based on the result that for k > 3, the complete multipartite graph K2?(k−1),3 is not on-line k-choosable, the on-line version ...

متن کامل

Choice number of complete multipartite graphs K3*3, 2*(k-5), 1*2 and K4, 3*2, 2*(k-6), 1*3

A graphG is called chromatic-choosable if its choice number is equal to its chromatic number, namely Ch(G) = χ(G). Ohba has conjectured that every graph G satisfying |V (G)| ≤ 2χ(G)+1 is chromatic-choosable. Since each k-chromatic graph is a subgraph of a complete k-partite graph, we see that Ohba’s conjecture is true if and only if it is true for every complete multipartite graph. However, the...

متن کامل

List Colouring Big Graphs On-Line

In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13] and Zhu [19]. We prove that the on-line version of Ohba’s conjecture is true in the class of planar graphs. We also consider several alternate on-line list colouring models.

متن کامل

Three Topics in Online List Coloring∗

In online list coloring (introduced by Zhu and by Schauz in 2009), on each round the set of vertices having a particular color in their lists is revealed, and the coloring algorithm chooses an independent subset to receive that color. The paint number of a graph G is the least k such that there is an algorithm to produce a successful coloring with no vertex being shown more than k times; it is ...

متن کامل

Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices

Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosability” of G). Noel, Reed, and Wu proved the conjecture of Ohba that ch(G) = χ(G) when |V (G)| ≤ 2χ(G) + 1. We extend this to a general upper bound: ch(G) ≤ max{χ(G), ⌈(|V (G)| + χ(G)− 1)/3⌉}. Our result is sharp for |V (G)| ≤ 3χ(G) using Ohba’s examples, and it improves the best-known upper bound for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007